Strong Wavefront Lemma and Counting Lattice Points in Sectors
نویسندگان
چکیده
We compute the asymptotics of the number of integral quadratic forms with prescribed orthogonal decompositions and more generally, the asymptotics of the number of lattice points lying in sectors of affine symmetric spaces. A new key ingredient in this article is the strong wavefront lemma, which shows that the generalized Cartan decomposition associated to a symmetric space is uniformly Lipschitz. ∗ The first and the second authors partially supported by NSF 0400631 and NSF 0333397, respectively. Received February 29, 2008
منابع مشابه
Orbits of Discrete Subgroups on a Symmetric Space and the Furstenberg Boundary
Abstract. LetX be a symmetric space of noncompact type and Γ a lattice in the isometry group of X . We study the distribution of orbits of Γ acting on the symmetric space X and its geometric boundaryX(∞). More precisely, for any y ∈ X and b ∈ X(∞), we investigate the distribution of the set {(yγ, bγ) : γ ∈ Γ} in X ×X(∞). It is proved, in particular, that the orbits of Γ in the Furstenberg bound...
متن کاملLattice Point Counting and Height Bounds over Number Fields and Quaternion Algebras
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit applications of a particular estimate of this sort to several counting problems in number theory: counting integral points and units of bounded height over ...
متن کاملMorpho-phenology and chromosome number of Iranian Bromus danthoniae Trin. genotypes
ABSTRACT- Bromus danthoniae Trin. is an annual grass species which grows mainly on dry grassy rocky mountain slopes and grassy steppe, and is grazed by many herbivores and recognized as a useful pasture plant. The chromosome number, morphological and anatomical traits of 82 genotypes of B. danthoniae belonging to three sub-taxa were investigated. Twenty-seven quantitative and 20 qualitative mor...
متن کاملCounting Lattice Paths via a New Cycle Lemma
Let α, β,m, n be positive integers. Fix a line L : y = αx + β, and a lattice point Q = (m,n) on L. It is well known that the number of lattice paths from the origin to Q which touches L only at Q is given by β m+ n “m+ n m ” . We extend the above formula in various ways, in particular, we consider the case when α and β are arbitrary positive reals. The key ingredient of our proof is a new varia...
متن کاملA Simple Algorithm for Lattice Point Counting in Rational Polygons
We propose a simple algorithm for lattice point counting in rational polygons. A rational polygon is one whose vertices have rational coordinates. The algorithm decomposes a given polygon into right trapezoids and counts the number of lattice points in the right trapezoids. Each right trapezoid can be dissected into a rectangle and a right-angled triangle in the obvious way. The number of latti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006